Dynamic programming and planarity: Improved tree-decomposition based algorithms
نویسندگان
چکیده
منابع مشابه
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Westudy some structural properties for tree-decompositions of 2-connected planar graphs that we use to improve upon the runtime of tree-decomposition based dynamic programming approaches for several NP-hard planar graph problems. E.g., we derive the fastest algorithm for Planar Dominating Set of runtime 3tw · nO(1), when we take the width tw of a given tree-decomposition as the measure for the ...
متن کاملHow to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
We prove new structural properties for tree-decompositions of planar graphs that we use to improve upon the runtime of tree-decomposition based dynamic programming approaches for several NP-hard planar graph problems. We give for example the fastest algorithm for Planar Dominating Set of runtime 3 · n, when we take the treewidth tw as the measure for the exponential worst case behavior. We also...
متن کاملEvaluating Tree-Decomposition Based Algorithms for Answer Set Programming
A promising approach to tackle intractable problems is given by a combination of decomposition methods with dynamic algorithms. One such decomposition concept is tree decomposition. However, several heuristics for obtaining a tree decomposition exist and, moreover, also the subsequent dynamic algorithm can be laid out differently. In this paper, we provide an experimental evaluation of this com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.10.011